Corrigenda to "Calculation of the regulator of Q(√D) by use of the nearest integer continued fraction algorithm"

نویسندگان

  • Keith R. Matthews
  • John P. Robertson
  • Jim White
چکیده

There are some minor errors in one of the algorithms and two of the tables in a paper by Williams and Buhr. These errors do not affect the major conclusions of the paper. We present corrections to one of the algorithms and two of the tables in [1]. These corrections do not affect the major conclusions of the paper. In the algorithm for computing the NICF of √ D on the bottom half of page 373, when Qk < 0, Tk should be defined as • If Qk + F + 1 is even, then Tk = d+ (|Qk|+ F + 1)/2 . • If Qk + F + 1 is odd, then Tk = 1 + d+ (|Qk|+ F + 1)/2 . R′ k+1 should be defined as • If Qk+1 < 0 and Qk+1 divides P ′ k+1 + Tk+1 evenly, then R′ k+1 = |Qk+1|. • Otherwise, R′ k+1 is, as in [1], the remainder on dividing P ′ k+1 + Tk+1 by Qk+1. Note that the formula for R′ k+1 has to be used with k = −1 in order to set the value of R′ 0. In the other formulas in this algorithm k ≥ 0. Also, P ′ k+1 = Tk −R′ k. The description of Table 1 in [1] should read, “In Table 1 we give the frequency of occurrence of each of these criteria for the NICF expansion of √ D for each nonsquare 10 ≤ D < M .” Corrected values for the Table 1 in [1] are given in “Table 1 (with corrections)”. Table 1 (with corrections) Condition M = 10,000 M = 100,000 M = 1,000,000 M = 10,000,000 1 7,370 76,155 776,894 7,882,803 2 880 9,698 101,347 1,032,817 3 324 2,340 18,093 146,161 4 785 6,819 60,702 552,135 5 153 1,302 11,734 106,995 6 382 3,363 30,224 275,920 Received by the editor January 15, 2008. 2000 Mathematics Subject Classification. Primary 11A55. c ©2008 American Mathematical Society 615 License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use 616KEITH R. MATTHEWS, JOHN P. ROBERTSON, AND JIM WHITE The corrected Table 1 agrees with that in [1] for M = 10, 000, but most of thevalues to 100,000 and to 1,000,000 in the corrected table are slightly different fromthose in [1]. We have added counts to 10 million.In Table 2 of [1] each Θ should be 2Θ. For Case 6, the log(√D +|Qρ−1/2|) in[1] should be log(√D −|Qρ−1/2|).References[1] H. C. Williams and P. A. Buhr, Calculation of the regulator of Q(√D) by use of the nearestinteger continued fraction algorithm, Math. Comp. 33 (145) (1979), 369–381. MR514833(80e:12003) Department of Mathematics, University of Queensland, St. Lucia, Brisbane, QLD4072, Australia, and Centre for Mathematics and its Applications, Australian NationalUniversity, Canberra, ACT 0200, AustraliaE-mail address: [email protected] Actuarial and Economic Services Division, National Council on Compensation Insur-ance, Boca Raton, Florida 33487E-mail address: [email protected] Mathematical Sciences Institute, Australian National University, Canberra, ACT0200, AustraliaE-mail address: [email protected] License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the real quadratic fields with certain continued fraction expansions and fundamental units

The purpose of this paper is to investigate the real quadratic number fields $Q(sqrt{d})$ which contain the specific form of the continued fractions expansions of integral basis element  where $dequiv 2,3( mod  4)$ is a square free positive integer. Besides, the present paper deals with determining the fundamental unit$$epsilon _{d}=left(t_d+u_dsqrt{d}right) 2left.right > 1$$and  $n_d$ and $m_d...

متن کامل

An Analogue of the Nearest Integer Continued Fraction for Certain Cubic Irrationalities

Let 8 be any irrational and define Ne(9) to be that integer such that \8 Ne{6)\ < \. Put p0 = 6, r0 = Ne(p0), pk+ | = \/(rk pk), rk+x = Ne(pk+I). Then the r's here are the partial quotients of the nearest integer continued fraction (NICF) expansion of 9. When D is a positive nonsquare integer, and 6 = {D, this expansion is periodic. It can be used to find the regulator of 2(/JD ) in less than 7...

متن کامل

Unisequences and Nearest Integer Continued Fraction Midpoint Criteria for Pell’s Equation

The nearest integer continued fractions of Hurwitz, Minnegerode (NICF-H) and in Perron’s book Die Lehre von den Kettenbrüchen (NICF-P) are closely related. Midpoint criteria for solving Pell’s equation x2 − Dy2 = ±1 in terms of the NICF-H expansion of √ D were derived by H. C. Williams using singular continued fractions. We derive these criteria without the use of singular continued fractions. ...

متن کامل

Midpoint criteria for solving Pell's equation using the nearest square continued fraction

We derive midpoint criteria for solving Pell’s equation x2−Dy2 = ±1, using the nearest square continued fraction expansion of √ D. The period of the expansion is on average 70% that of the regular continued fraction. We derive similar criteria for the diophantine equation x2 − xy − (D−1) 4 y2 = ±1, where D ≡ 1 (mod 4). We also present some numerical results and conclude with a comparison of the...

متن کامل

Detection of some Tree Species from Terrestrial Laser Scanner Point Cloud Data Using Support-vector Machine and Nearest Neighborhood Algorithms

acquisition field reference data using conventional methods due to limited and time-consuming data from a single tree in recent years, to generate reference data for forest studies using terrestrial laser scanner data, aerial laser scanner data, radar and Optics has become commonplace, and complete, accurate 3D data from a single tree or reference trees can be recorded. The detection and identi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Comput.

دوره 78  شماره 

صفحات  -

تاریخ انتشار 2009